Tree Decomposition-based Approach for Compiling Independent Sets
نویسندگان
چکیده
منابع مشابه
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an ‘active’ role. In this paper we analyze an extension of the original constructive negation in order to gracefully integrate with the management of set-constraints in the context of a Constraint Logic Programming Language dealing with finite sets. W...
متن کاملCompiling Devices: A Structure-Based Approach
We present an approach for compiling a device into a propositional sentence (in negation normal form) and then show how to answer interesting diagnostic queries based on such a device compilation. We present two key results about our compilation approach, which makes it of interest to the diagnostic community. First, the complexity of answering diagnostic queries | which includes nd-ing minimum...
متن کاملA New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)
Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...
متن کاملA Portfolio Approach for Enforcing Minimality in a Tree Decomposition
Minimality, a highly desirable consistency property of Constraint Satisfaction Problems (CSPs), is in general too expensive to enforce. Previous work has shown the practical benefits of restricting minimality to the clusters of a tree decomposition, allowing us to solve many difficult problems in a backtrack-free manner. We explore two alternative algorithms for enforcing minimality whose perfo...
متن کاملOn the Number of Independent Sets in a Tree
We show in a simple way that for any k,m ∈ N, there exists a tree T such that the number of independent sets of T is congruent to k modulo m. This resolves a conjecture of Wagner (Almost all trees have an even number of independent sets, Electron. J. Combin. 16 (2009), # R93). 1 The number of independent sets in a tree A set of vertices in a graph G is called independent if the set induces no e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2020
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.28.354